منابع مشابه
Considerations regarding the paradox of Thoralf Skolem (1957)
About 35 years ago from now, in occasion of a congress in Helsingfors, Thoralf Skolem pointed out a paradoxical consequence of a theorem by Löwenheim, for which he had presented a simplified proof two years earlier using the logical normal form [logischen Normalform] named after him. This well-known theorem by Löwenheim says that for every mathematical theory axiomatized in the framework of ele...
متن کاملGrigori Mints Thoralf Skolem and the Epsilon Substitution Method for Predicate Logic *
Skolem’s contributions to mathematical logic are fundamental and far-reaching. A good survey by Hao Wang (1970) is presented in Fenstad’s collection of Skolem’s works (1970). Even Skolemization, i.e. the replacement of quantifiers by new constant and function symbols, is too extensive for one talk. Cf. my survey (Mints 1990) of proof-theoretic aspects and more recent work (Shankar 1992) concern...
متن کاملIn Memorian. Remembrances of Maddie.
Our perfusion community and AmSECT, in particular, lost a dedicated pioneer in August with the passing of Madeline M. Massengale-Beall. We wish, and often believe, good friends will always be around, but when the reality of their passing occurs, it is a shock and then profound sadness sets in, and we are only left with memories. Such are our feelings now. Herein, we reflect on Maddie’s numerous...
متن کاملSkolem fragments
W. V. Quine splits the fundamental question of ontology—What is there?—into two questions: What does a theory say that there is? and What theories ought we adopt? Of these, only the former seems amenable to philosophical treatment. Quine thus attempts to formulate an adequate criterion of ontological commitment. Syntactically, the initially existentially quantified sentences of a theory appear ...
متن کاملSkolem Machines
The Skolem machine is a Turing-complete machine model where the instructions are first-order formulas of a specific form. We introduce Skolem machines and prove their logical correctness and completeness. Skolem machines compute queries for the Geolog language, a rich fragment of first-order logic. The concepts of Geolog trees and complete Geolog trees are defined, and these tree concepts are u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Mathematica
سال: 1963
ISSN: 0001-5962
DOI: 10.1007/bf02391852